LDPC Codes For The Classic Bursty Channel
نویسندگان
چکیده
In this paper we consider low-density parity-check (LDPC) codes for the classic bursty channel. We present lower bounds on the maximum resolvable erasure burst length, Lmax, for arbitrary LDPC codes and then present constructions for LDPC codes with good burst erasure correction performance for channels with and without the presence of noise in the guard band.
منابع مشابه
Burst Correction Coding From Low-Density Parity-Check Codes
BURST CORRECTION CODING FROM LOW-DENSITY PARITY-CHECK CODES Wai Han Fong, PhD George Mason University, 2015 Dissertation Director: Dr. Shih-Chun Chang Dissertation Co-Director: Dr. Shu Lin This thesis explores techniques and theoretical bounds on efficiently encodable low-density parity-check (LDPC) codes for correcting single and multiple bursts of erasures and/or errors. The approach is to co...
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملApproaching the Slepian-Wolf Limit with LDPC Coset Codes
We consider the Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes. We derive the density evolution formula for the Slepian-Wolf coding, equipped with a concentration theorem. An intimate connection between the Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, each Slepian-Wolf source coding problem is equivalen...
متن کاملAdvanced Storage Technology Consortium Research Proposal Template Descriptive Title of Proposal
Sparse graph-based codes such as low-density parity-check (LDPC) codes have revolutionized coding theory and have been proposed for many emerging communication and storage systems due to their excellent performance. A substantial amount of research has been devoted to the study of binary LDPC codes. In contrast, non-binary LDPC codes had been deemed too complex and consequently have not been st...
متن کاملGTTI 2008: sessione Trasmissione Numerica Non-binary LDPC codes with good performance on channels affected by bursty noise
Non-binary Reed-Solomon (RS) codes represent a typical way to counteract the effects of error bursts in hard-disk drives (HDD). Recently, it has been demonstrated how q-ary low-density paritycheck (LDPC) codes can outperform RS codes through a proper construction of the parity check (PC) matrix. In this work, two matrix design schemes, based on the main definitions of erasure burst proposed in ...
متن کامل